Improved PISO algorithms for modeling density varying flow in conjugate fluid–porous domains
نویسندگان
چکیده
منابع مشابه
Improved PISO algorithms for modeling density varying flow in conjugate fluid-porous domains
Article history: Received 11 June 2015 Received in revised form 6 November 2015 Accepted 12 November 2015 Available online 21 November 2015
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملImproved Algorithms for Bipartite Network Flow
In this paper, network flow algorithms for bipartite networks are studied. A network G = (V. E) is called bipartite if its vertex set V can be partitioned into two subsets V1 and V2 such that all edges have one endpoint in VY and the other in V2. Let n = I., nl = ll I1, n = IV21, m = El and assume without loss of generality that n s < n2. A bipartite network is called unbalanced if n << n and b...
متن کاملImproved Approximation Algorithms for Unsplittable Flow Problems
In the single-source unsplittable ow problem we are given a graph G; a source vertex s and a set of sinks t 1 ; : : :; t k with associated demands. We seek a single s-t i ow path for each commodity i so that the demands are satissed and the total ow routed across any edge e is bounded by its capacity c e : The problem is an NP-hard variant of max ow and a generalization of single-source edge-di...
متن کاملImproved Algorithms for Resource Allocation under Varying Capacity
We consider the problem of scheduling a set of jobs on a system that offers certain resource, wherein the amount of resource offered varies over time. For each job, the input specifies a set of possible scheduling instances, where each instance is given by starting time, ending time, profit and resource requirement. A feasible solution selects a subset of job instances such that at any timeslot...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Physics
سال: 2016
ISSN: 0021-9991
DOI: 10.1016/j.jcp.2015.11.035